349 research outputs found
Antichain cutsets of strongly connected posets
Rival and Zaguia showed that the antichain cutsets of a finite Boolean
lattice are exactly the level sets. We show that a similar characterization of
antichain cutsets holds for any strongly connected poset of locally finite
height. As a corollary, we get such a characterization for semimodular
lattices, supersolvable lattices, Bruhat orders, locally shellable lattices,
and many more. We also consider a generalization to strongly connected
hypergraphs having finite edges.Comment: 12 pages; v2 contains minor fixes for publicatio
Canonical gravity in two time and two space dimensions
We describe a program for developing a canonical gravity in 2+2 dimensions
(two time and two space dimensions). Our procedure is similar to the usual
canonical gravity but with two times rather than just one time. Our work may be
of particular interest as an alternative approach to loop quantum gravity in
2+2 dimensions.Comment: 13 pages, Latex, improved versio
Connectivity of pseudomanifold graphs from an algebraic point of view
The connectivity of graphs of simplicial and polytopal complexes is a
classical subject going back at least to Steinitz, and the topic has since been
studied by many authors, including Balinski, Barnette, Athanasiadis and
Bjorner. In this note, we provide a unifying approach which allows us to obtain
more general results. Moreover, we provide a relation to commutative algebra by
relating connectivity problems to graded Betti numbers of the associated
Stanley--Reisner rings.Comment: 4 pages, minor change
Combinatorial Alexander Duality -- a Short and Elementary Proof
Let X be a simplicial complex with the ground set V. Define its Alexander
dual as a simplicial complex X* = {A \subset V: V \setminus A \notin X}. The
combinatorial Alexander duality states that the i-th reduced homology group of
X is isomorphic to the (|V|-i-3)-th reduced cohomology group of X* (over a
given commutative ring R). We give a self-contained proof.Comment: 7 pages, 2 figure; v3: the sign function was simplifie
Lattice congruences of the weak order
We study the congruence lattice of the poset of regions of a hyperplane
arrangement, with particular emphasis on the weak order on a finite Coxeter
group. Our starting point is a theorem from a previous paper which gives a
geometric description of the poset of join-irreducibles of the congruence
lattice of the poset of regions in terms of certain polyhedral decompositions
of the hyperplanes. For a finite Coxeter system (W,S) and a subset K of S, let
\eta_K:w \mapsto w_K be the projection onto the parabolic subgroup W_K. We show
that the fibers of \eta_K constitute the smallest lattice congruence with
1\equiv s for every s\in(S-K). We give an algorithm for determining the
congruence lattice of the weak order for any finite Coxeter group and for a
finite Coxeter group of type A or B we define a directed graph on subsets or
signed subsets such that the transitive closure of the directed graph is the
poset of join-irreducibles of the congruence lattice of the weak order.Comment: 26 pages, 4 figure
Relative blocking in posets
Poset-theoretic generalizations of set-theoretic committee constructions are
presented. The structure of the corresponding subposets is described. Sequences
of irreducible fractions associated to the principal order ideals of finite
bounded posets are considered and those related to the Boolean lattices are
explored; it is shown that such sequences inherit all the familiar properties
of the Farey sequences.Comment: 29 pages. Corrected version of original publication which is
available at http://www.springerlink.com, see Corrigendu
Enumeration of bigrassmannian permutations below a permutation in Bruhat order
In theory of Coxeter groups, bigrassmannian elements are well known as
elements which have precisely one left descent and precisely one right descent.
In this article, we prove formulas on enumeration of bigrassmannian
permutations weakly below a permutation in Bruhat order in the symmetric
groups. For the proof, we use equivalent characterizations of bigrassmannian
permutations by Lascoux-Schutzenberger and Reading.Comment: 7 pages
Topological representations of matroid maps
The Topological Representation Theorem for (oriented) matroids states that
every (oriented) matroid can be realized as the intersection lattice of an
arrangement of codimension one homotopy spheres on a homotopy sphere. In this
paper, we use a construction of Engstr\"om to show that structure-preserving
maps between matroids induce topological mappings between their
representations; a result previously known only in the oriented case.
Specifically, we show that weak maps induce continuous maps and that the
process is a functor from the category of matroids with weak maps to the
homotopy category of topological spaces. We also give a new and conceptual
proof of a result regarding the Whitney numbers of the first kind of a matroid.Comment: Final version, 21 pages, 8 figures; Journal of Algebraic
Combinatorics, 201
On the non-existence of an R-labeling
We present a family of Eulerian posets which does not have any R-labeling.
The result uses a structure theorem for R-labelings of the butterfly poset.Comment: 6 pages, 1 figure. To appear in the journal Orde
- …